Hash-processing of universal quantification-like queries dealing with requirements and prohibitions

This paper is focused on flexible universal quantification-like queries handling simultaneously positive and negative preferences (requirements or prohibitions). We emphasise the performance improvement of considered operator by proposing new variants classical hash-division algorithm. The issue answers ranking also dealt with. target in our work memory databases systems (also called main-memory database systems) with a very large volume data. In these systems, all data primarily stored RAM computer. have introduced parallel implementation that takes into account skew issue. Our empirical analysis for both sequential versions shows relevance approach. They demonstrate processing mixed achieves better compared to conventional ones, becomes faster through parallelism.